Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
571	ICS 162 – Spring 2001 – Final Exam Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2003-12-01 14:01:08 Applied mathematics Automata theory Models of computation Mathematical optimization NP Deterministic pushdown automaton Pushdown automaton P Complement Theoretical computer science Computational complexity theory Complexity classes
572	Independence and Concurrent Separation Logic Jonathan Hayman and Glynn Winskel Computer Laboratory, University of Cambridge Abstract A compositional Petri net based semantics is given to a simple pointer-manipulating lan Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2006-05-30 05:29:39 Petri net Models of computation Symbol Model theory
573	1 Complexity of Algorithms Lecture Notes, SpringPeter G´acs Add to Reading List Source URL: www.cs.elte.hu Language: English - Date: 2010-10-17 05:06:21 Complexity classes Analysis of algorithms Probabilistic complexity theory Computational resources NP Time complexity P Randomized algorithm Theory of computation Theoretical computer science Computational complexity theory Applied mathematics
574	Things Computer Science Tells Us About Philosophy Rudy Rucker Department of Computer Science San Jose State University, CA www.rudyrucker.com Add to Reading List Source URL: www.rudyrucker.com Language: English - Date: 2005-09-26 14:03:35 Rudy Rucker Artificial intelligence Computational neuroscience A New Kind of Science Computation Dialectic Strong AI Applied mathematics Mathematics Science Computability theory Clarion Workshop
575	Recurs on Recursion Recursion Recursion Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:41:57 Computing Recursion Computability theory Subroutines Theory of computation Infinite loop Tower of Hanoi Computer programming Software engineering Programming idioms
576	Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I John McCarthy, Massachusetts Institute of Technology, Cambridge, Mass. April Add to Reading List Source URL: www-formal.stanford.edu Language: English - Date: 2006-08-13 19:55:54 Computability theory Predicate logic Lisp programming language Formal languages Function Free variables and bound variables Combinatory logic Expression Lisp Logic Mathematics Mathematical logic
577	Planning as Model Checking in Hybrid Domains Sergiy Bogomolov Daniele Magazzeni Andreas Podelski Add to Reading List Source URL: ai.cs.unibas.ch Language: English - Date: 2014-07-02 05:16:10 Automated planning and scheduling Planning Domain Definition Language Theoretical computer science Models of computation Hybrid automaton Formal languages Finite-state machine Hybrid system Alphabet Automata theory Differential equations Mathematics
578	MAP Reconstruction from Spatially Correlated PET Data Adam Alessio, Ken Sauer, and Charles A. Bouman Abstract— High sensitivity 3D PET data is often rebinned into 2D data sets in order to reduce the computation time of Add to Reading List Source URL: faculty.washington.edu Language: English - Date: 2005-11-10 13:24:09 Data analysis Algebra of random variables Covariance Expectation–maximization algorithm Positron emission tomography Maximum likelihood Minimum mean square error 3D modeling Statistics Estimation theory Covariance and correlation
579	Automated Grading of DFA Constructions Rajeev Alur and Loris D’Antoni Sumit Gulwani Dileep Kini and Mahesh Viswanathan Department of Computer Science Microsoft Research Department of Computer Science Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2013-05-16 00:14:15 Model theory Models of computation Formal languages Abstraction Metalogic Deterministic finite automaton Nondeterministic finite automaton Interpretation DFA minimization Automata theory Mathematics Logic
580	Logic and the Methodology of Science November 2003 Preliminary Exam August 23, Let L be a first-order language. We say that the L-structure M is pseudofinite if for every L-sentence φ if M \|= φ, then there is a Add to Reading List Source URL: logic.berkeley.edu Language: English - Date: 2014-08-24 16:43:20 Ordinal number Symbol Philosophy of mathematics Probability theory Theory of computation Ω-consistent theory Forcing Mathematical logic Mathematics Constructible universe

UPDATE